Video Coding Using at Fast Non-Separable Matching Pursuits Algorithm
نویسندگان
چکیده
This paper presents a fast matching pursuits algorithm. In addition to a fast implementation, the algorithm also allows the ef ic ient use of non-separable dictionary basis functions. The use of non-separable components allows basis functions which provide a better match t o diagonally orientated image features. In order to demonstrate the proposed method, a simple dictionary is developed and used. Even without any sophisticated entropy coding, the proposed s:ystem gives performance exceeding that of H.263.
منابع مشابه
Video Coding using a Fast Non-Separable Matching Pursuits Algorithm
This paper presents a fast matching pursuits algorithm. In addition to a fast implementation, the algorithm also allows the ef ic ient use of non-separable dictionary basis functions. The use of non-separable components allows basis functions which provide a better match t o diagonally orientated image features. In order to demonstrate the proposed method, a simple dictionary is developed and u...
متن کاملMatching pursuits video coding: Dictionaries and fast implementation
Matching pursuits over a basis of separable Gabor functions has been demonstrated to outperform DCT methods for displaced frame difference coding for video compression. Unfortunately, apart from very low bit-rate applications, the algorithm involves an extremely high computational load. This paper contains original contribution to the issues of dictionary selection and fast implementation for m...
متن کاملRobust matching pursuits video transmission using the HIPERLAN/1 air interface standard
Matching pursuits ovcr a basis of separable Gabor furictions has recently been demonstrated to outperform DCT methods for low bit rate video coding. This paper introduces an error r-csilient implementation of the matching pursuits algorithm, based on the Error Resilient Positional Code. Coded video is transmitted using the simulated HIPERLAN/l air interface standard. which recommends ARQ as a m...
متن کاملVery low bit rate video coding using matching pursuits
The term matching pursuits refers to a greedy algorithm which matches signal structures to a large, diverse dictionary of functions. The technique was proposed by Mallat and Zhang 1 with an application to signal analysis. In this paper, we show how matching pursuits can be used to e ectively code the motion residual in a hybrid video coding system at bit rates below 20 kbit/s. One advantage of ...
متن کاملVery low bit-rate video coding based on matching pursuits
We present a video compression algorithm which performs well on generic sequences at very low bit rates. This algorithm was the basis for a submission to the November 1995 MPEG-4 subjective tests. The main novelty of the algorithm is a matching-pursuit based motion residual coder. The method uses an inner-product search to decompose motion residual signals on an overcomplete dictionary of separ...
متن کامل